Guilbaud ’ S 1952 Theorem on the Logical Problem of Aggregation

نویسندگان

  • Daniel ECKERT
  • Bernard MONJARDET
چکیده

résumé – Le théorème de Guilbaud de 1952 sur le problème logique de l’agrégation Dans un article publié en 1952, peu après la publication du théorème d’impossibilité d’Arrow, le mathématicien français Georges-Théodule Guilbaud a obtenu un résultat dictatorial pour le problème logique de l’agrégation, anticipant ainsi la théorie abstraite de l’agrégation et celle de l’agrégation des jugements. Nous donnons une reconstruction de la preuve du théorème de Guilbaud, qui présente aussi un intérêt technique, puisqu’elle peut être vue comme le premier emploi des ultrafiltres en théorie du choix social. mots-clés – Agrégation, Agrégation des jugements, Connecteurs logiques, Jeu simple, Ultrafiltre

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

de Travail du Centre d ’ Economie de la Sorbonne Guilbaud ’ s Theorem : An early contribution to judgment aggregation Daniel ECKERT , Bernard MONJARDET 2009

In a paper published in 1952 the French mathematician Georges-Théodule Guilbaud has generalized Arrow’s impossibility result to the "logical problem of aggregation", thus anticipating the literature on abstract aggregation theory and judgment aggregation. We reconstruct the proof of Guilbaud’s theorem, which is also of technical interest, because it can be seen as the …rst use of ultra…lters in...

متن کامل

de Travail du Centre d ’ Economie de la Sorbonne Guilbaud ’ s Theorem : An early contribution to judgment aggregation

In a paper published in 1952 the French mathematician Georges-Théodule Guilbaud has generalized Arrow’s impossibility result to the "logical problem of aggregation", thus anticipating the literature on abstract aggregation theory and judgment aggregation. We reconstruct the proof of Guilbaud’s theorem, which is also of technical interest, because it can be seen as the …rst use of ultra…lters in...

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

The uniqueness theorem for inverse nodal problems with a chemical potential

In this paper, an inverse nodal problem for a second-order differential equation having a chemical potential on a finite interval is investigated. First, we estimate the nodal points and nodal lengths of differential operator. Then, we show that the potential can be uniquely determined by a dense set of nodes of the eigenfunctions.

متن کامل

A Uniqueness Theorem of the Solution of an Inverse Spectral Problem

This paper is devoted to the proof of the unique solvability ofthe inverse problems for second-order differential operators withregular singularities. It is shown that the potential functioncan be determined from spectral data, also we prove a uniquenesstheorem in the inverse problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010